Access Time Modeling of a MLR1 Tape Drive

نویسندگان

  • Olav Sandstå
  • Thomas Maukon Andersen
  • Roger Midtstraum
  • Rune Sætre
چکیده

Traditionally, digital tape has been used by applications accessing the tape mostly sequentially. Applications having a random access pattern to the data are much better off storing the data on magnetic disks. Today we see new application areas, where the need for huge amounts of digital storage does not make it cost-effective to store all the data on magnetic disk. One example of such an application is digital video archives. In this paper, we present an access model for a Tandberg MLR1 serpentine tape drive. For such a drive, there is no direct relation between the logical block address and the corresponding physical position on the tape. This makes it difficult to optimize the usage of the tape drive when we have concurrent accesses to the tape. The paper presents a generic model of a serpentine tape drive together with several algorithms for characterizing individual tapes to improve the accuracy of the model. Based on measurements using the MLR1 tape drive the generic model is improved. This extended model makes it possible to estimate seek times with an average error of about two seconds.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random I/O Performance of a Tandberg MLR1 Tape Drive

This paper presents an access time model for the Tandberg MLR1 serpentine tape drive and provides low-cost algorithms to characterize this model for each individual tape. The access time model is used to study the effects of scheduling of I/O requests. Simulations and experiments show that use of proper scheduling algorithms provides substantial improvement of the random I/O performance.

متن کامل

Improving the Access Time Performance of Serpentine Tape Drives

This paper presents a general model for estimating access times of serpentine tape drives. The model is used to schedule I/O requests in order to minimize the total access time. We propose a new scheduling algorithm, Multi-Pass Scan Star (MPScan*), which makes good utilization of the streaming capability of the tape drive and avoids the pitfalls of naive multi-pass scan algorithms and greedy al...

متن کامل

Low-Cost Access Time Model for a Serpentine Tape Drive

When a serpentine tape drive is used as a slow random access device, the I/O performance can be substantially improved by clever re-ordering of the I/O requests. This kind of re-ordering relies on a scheduling algorithm and a model of the access time. In this paper, we propose a low-cost access time model for serpentine tape drives, which is not a trivial task due to the complex data layout of ...

متن کامل

Low-Cost Access Time Model for Serpentine Tape Drives

When a serpentine tape drive is used as a slow random access device, the I/O performance can be substantially improved by clever re-ordering of the I/O requests. This kind of re-ordering relies on a scheduling algorithm and a model of the access time. In this paper, we propose a low-cost access time model for serpentine tape drives, which is not a trivial task due to the complex data layout of ...

متن کامل

Data Placement Techniques for Serpentine Tapes

Due to the information explosion we are witnessing, a growing number of applications store, maintain, and retrieve large volumes of data, where the data is required to be available online or near-online. These data repositories are implemented using hierarchical storage structures (HSS). One of the components of HSS is tertiary storage, which provides a cost-effective storage for the vast amoun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997